Robust Decoding for Non-Gaussian CDMA and Non-Exponential Timing Channels - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
نویسنده
چکیده
The capacity region of the two-user Gaussian CDMA channel is shown to be achievable when the (stationary, ergodic) noise is not Gaussian, using a decoder matched to the Gaussian distribution. Similarly, the capacity of the exponential server timing channel is shown to be achievable when the service distribution is not exponential, using a decoder matched to the exponential distribution. The codebook in either case will depend on the true channel.
منابع مشابه
Nearest neighbor decoding for additive non-Gaussian noise channels
We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original c...
متن کاملModulation and Coding for Linear Gaussian Channels - Information Theory, IEEE Transactions on
Shannon’s determination of the capacity of the linear Gaussian channel has posed a magnificent challenge to succeeding generations of researchers. This paper surveys how this challenge has been met during the past half century. Orthogonal minimumbandwidth modulation techniques and channel capacity are discussed. Binary coding techniques for low-signal-to-noise ratio (SNR) channels and nonbinary...
متن کاملHybrid equalization strategies for iterative equalization and decoding - Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Joint iterative equalization and decoding is a very successful approach to dealing with severe inter-symbol interference in band limited communication channels. We propose and investigate adaptive iterative methods that yield performance close to Turbo equalization while requiring considerably smaller complexity.
متن کاملExponential Convergence of Adaptive Algorithms - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
We introduce a novel method for analyzing a well known class of adaptive algorithms. By combining recent developments from the theory of Markov processes and long existing results from t h e theory of Perturbations of Linear Operators we s tudy first the behavior and convergence properties of a class of products of random matrices. This i n t u r n allows for the analysis of t h e first a n d s...
متن کاملBit Error Performance for Asynchronous Ds Cdma Systems Over Multipath Rayleigh Fading Channels (RESEARCH NOTE)
In recent years, there has been considerable interest in the use of CDMA in mobile communications. Bit error rate is one of the most important parameters in the evaluation of CDMA systems. In this paper, we develop a technique to find an accurate approximation to the probability of bit error for asynchronous direct–sequence code division multiple–access (DS/CDMA) systems by modeling the multipl...
متن کامل